Parallelization on a Minimal Substring Search Algorithm for Regular Expressions
نویسندگان
چکیده
Let us consider a regular expression r of length m and text string T n over an alphabet Σ. Then, the RE minimal substring search problem is to find all substrings matching r. Yamamoto proposed O(mn) time O(m) space algorithm using Thompson automaton. In this paper, we improve Yamamoto's by introducing parallelism. The runs in worst case O(mn/p) best case, where p denotes number processors. Besides, show parameter related parallel algorithm. We evaluate experimentally.
منابع مشابه
A Limited-diffusion Algorithm for Blind Substring Search
Applications are described for " blind substring search, " where a program to search files for a substring is published without revealing the substring. The " limited diffusion " approach proposed in a previous article is described. Design criteria for a Boolean function to be used in the limited diffusion algorithm are stated, and a function meeting the criteria is proposed. An algorithm for b...
متن کاملExperiments with a Very Fast Substring Search Algorithm
Sunday devised string matching methods that are generally faster than the Boyer-Moore algorithm. His fastest method used statistics of the language being scanned to determine the order in which character pairs are to be compared. In this paper the performances of similar, but language-independent, algorithms are examined. Results comparable with language-based algorithms can he achieved with an...
متن کاملA Fast Regular Expressions Matching Algorithm for NIDS
In this paper, we propose a new algorithm to accelerate the searching speed in network intrusion detection system (NIDS) and we implement our algorithm in Snort, a popular open-source intrusion detection system. The algorithm is based on the fact that normal data stream rarely matches any virus signature and different packets need to check different keys. The algorithm does not need preprocessi...
متن کاملOn Extended Regular Expressions
In this paper we extend the work of Campeanu, Salomaa and Yu [1] on extended regular expressions featured in the Unix utility egrep and the popular scripting language Perl. We settle the open issue of closure under intersection and provide an improved pumping lemma that will show that a larger class of languages is not recognizable by extended regular expressions. We also investigate some quest...
متن کاملOn Practical Regular Expressions
We report on simulation, hierarchy, and decidability results for Practical Regular Expressions (PRE), which may include back references in addition to the standard operations union, concatenation, and star. The following results are obtained: • PRE can be simulated by the classical model of nondeterministic finite automata with sensing one-way heads. The number of heads depends on the number of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2023
ISSN: ['0916-8532', '1745-1361']
DOI: https://doi.org/10.1587/transinf.2022edp7105